package com.itheima;

import java.util.Comparator;
import java.util.Iterator;
import java.util.TreeSet;

public class TreeSetDemo {
    public static void main(String[] args) {
        int result = 0;
        sum(1,2,3,4,5);
        test0();
        test2();
    }

    private static void test0() {
        TreeSet<Integer> set1 = new TreeSet<>();

        set1.add(5);
        set1.add(3);
        set1.add(2);
        set1.add(4);
        set1.add(1);
        for (Integer  integer : set1){
            System.out.println(integer);
        }
    }

    /*public static void test1(){
        TreeSet<Student> set = new TreeSet<>();
        set.add(new Student("钱七", 22));
        set.add(new Student("张三", 18));
        set.add(new Student("李四", 19));
        set.add(new Student("王五", 20));
        set.add(new Student("赵六", 20));


        for (Student student : set){
            System.out.println(student.getName() + "---" + student.getAge());
        }
    }*/
    public static void test2(){
        /*Comparator<Student> comparator = new Comparator<Student>() {
            @Override
            public int compare(Student o1, Student o2) {
                //如果是正序排，则让01-o2
                //如果是倒序排，则让o2-01
                return 0;
            }
        };*/
        Comparator<Student> comparator = (o1, o2) -> o2.getAge() - o1.getAge();
        TreeSet<Student> set = new TreeSet<>(comparator);
        set.add(new Student("钱七", 22));
        set.add(new Student("张三", 18));
        set.add(new Student("李四", 19));
        set.add(new Student("王五", 20));
        set.add(new Student("赵六", 20));

        for (Student student : set){
            System.out.println(student.getName() + "---" + student.getAge());
        }

    }
    public static int sum(int...a){
        int total = 0;
        for (int i = 0; i < a.length; i++){
            total += a[i];
        }
        return total;
    }
}
